Efficient Bit Serial Multipliers of Berlekamp Type In
نویسنده
چکیده
Using good properties of an optimal normal basis of type I in a finite field F2m , we present a design of a bit serial multiplier of Berlekamp type, which is very effective in computing xy. It is shown that our multiplier does not need a basis conversion process and a squaring operation is a simple permutation in our basis. Therefore our multiplier provides a fast and an efficient hardware architecture for a bit serial multiplication of two elements in F2m .
منابع مشابه
GF(2^m) Multiplication and Division Over the Dual Basis
In this paper an algorithm for GF(2") multiplication/division is presented and a new, more generalized definition of duality is proposed. From these the bit-serial Berlekamp multiplier is derived and shown to be a specific case of a more general class of multipliers. Furthermore, it is shown that hardware efficient, bit-parallel dual basis multipliers can also be designed. These multipliers hav...
متن کاملDesign and Implementation of a High Speed Systolic Serial Multiplier and Squarer for Long Unsigned Integer Using VHDL
A systolic serial multiplier for unsigned numbers is presented which operates without zero words inserted between successive data words, outputs the full product and has only one clock cycle latency. The multiplier is based on a modified serial/parallel scheme with two adjacent multiplier cells. Systolic concept is a well-known means of intensive computational task through replication of func...
متن کاملDesign and Implementation of a High Speed Systolic Serial Multiplier and Squarer for Long Unsigned Integer Using VHDL
A systolic serial multiplier for unsigned numbers is presented which operates without zero words inserted between successive data words, outputs the full product and has only one clock cycle latency. 
The multiplier is based on a modified serial/parallel scheme with two adjacent multiplier cells. Systolic concept is a well-known means of intensive computational task through replication of fu...
متن کاملNew serial architecture for the Berlekamp-Massey algorithm
We propose a new efficient serial architecture to implement the Berlekamp–Massey algorithm, which is frequently used in BCH and Reed–Solomon decoders. An inversionless Berlekamp–Massey algorithm is adopted which not only eliminates the finite-field inverter but also introduces additional parallelism. We discover a clever scheduling of three finite-field multipliers to implement the algorithm ve...
متن کاملDesign of Polynomial Basis Multipliers over Gf(2)
This article addresses an efficient hardware implementations for multiplication over finite field GF(2). Multiplication in GF(2) is very commonly used in cryptography and error correcting codes. An efficient hardware could reduce the cost and development for these applications. This work presents the hardware implementation of polynomial basis. In this case, the multipliers were designed using ...
متن کامل